A Robust Planning Algorithm for Groups of Entities in Discrete Spaces
نویسندگان
چکیده
منابع مشابه
A Robust Planning Algorithm for Groups of Entities in Discrete Spaces
Automated planning is a well-established field of artificial intelligence (AI), with applications in route finding, robotics and operational research, among others. The task of developing a plan is often solved by finding a path in a graph representing the search domain; a robust plan consists of numerous paths that can be chosen if the execution of the best (optimal) one fails. While robust pl...
متن کاملA Robust Control Design Technique for Discrete-Time Systems
A robust state feedback design subject to placement of the closed loop eigenvalues in a prescribed region of unit circle is presented. Quantitative measures of robustness and disturbance rejection are investigated. A stochastic optimization algorithm is used to effect trade-off between the free design parameters and to accomplish all the design criteria. A numerical example is given to illustra...
متن کاملCovering Spaces and Discrete Groups
We have already met covering spaces in Chapter 2, where our discussion was geometric and basically limited to definitions and examples. In this chapter, we return to this topic from a more algebraic point of view, which will allow us to produce numerous examples coming from group actions and to classify all covering spaces with given base (provided the latter is “nice” enough). The main tools w...
متن کاملA Genetic Algorithm for Robust Motion Planning
This paper proposes a solution by genetic algorithms to the problem of planning a robust and suboptimal trajectory in the velocity space of a mobile robot. Robust trajectories are obtained introducing cumulative noise in the evaluation of the fitness function and introducing modifications in the genetic algorithm to taking into account this new feature. Results are presented that show the perfo...
متن کاملGraphbots: cooperative motion planning in discrete spaces
Most previous theoretical work on motion planning for a group of robots has addressed the problem of path planning for the individual robots sequentially, in geometrically simple regions of Euclidean space (e.g., a planar region containing polygonal obstacles). In this paper, we define a version of the motionplanning problem in which the robots move simultaneously. We establish conditions under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2015
ISSN: 1099-4300
DOI: 10.3390/e17085422